//
// Created by zhang on 2018/9/23.
//
#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
void InorderTraversal( BinTree BT );  /* 中序遍历，由裁判实现，细节不表 */

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for ( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
    printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp==MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp==MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
    printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}

Position Find(BinTree BST, ElementType X){
    if(!BST)
        return NULL;
    if (X < BST->Data)
        return Find(BST->Left, X);
    else if (X > BST->Data)
        return Find(BST->Right, X);
    else
        return BST;
}


Position FindMin(BinTree BST){
    if(BST){
        while (BST->Left!=NULL){
            BST=FindMin(BST->Left);
        }
    }
    return BST;
}


Position FindMax(BinTree BST){
    if(BST){
        while(BST->Right!=NULL){
            BST = FindMax(BST->Right);
        }
    }
    return BST;
}


BinTree Insert( BinTree BST, ElementType X ){
    if(!BST){
        BST = (struct TNode *)malloc(sizeof(struct TNode));  // 这里一开始的时候写错了
        BST->Data = X;
        BST->Left = BST->Right = NULL;
    }else{
        if(X>BST->Data){
            BST->Right = Insert(BST->Right, X);
        }else if(X<BST->Data){
            BST->Left = Insert(BST->Left, X);
        }
    }
    return BST;
}


BinTree Delete( BinTree BST, ElementType X ){
    Position Tmp;
    if(!BST){
        printf("Not Found\n");
    }else if (BST->Data < X){
        BST->Right = Delete(BST->Right, X);
    }else if (BST->Data > X){
        BST->Left = Delete(BST->Left, X);
    }else{
        if(BST->Left != NULL && BST->Right != NULL){
            Tmp = FindMax(BST->Left);
            BST->Data = Tmp->Data;
            BST->Left = Delete(BST->Left, BST->Data);
        }else{
            Tmp = BST;
            if(!BST->Left){
                BST = BST->Right;
            }else if(!BST->Right){
                BST = BST->Left;
            }
            free(Tmp);
        }
    }
    return BST;
}
/*
函数Insert将X插入二叉搜索树BST并返回结果树的根结点指针；
函数Delete将X从二叉搜索树BST中删除，并返回结果树的根结点指针；如果X不在树中，则打印一行Not Found并返回原树的根结点指针；
函数Find在二叉搜索树BST中找到X，返回该结点的指针；如果找不到则返回空指针；
函数FindMin返回二叉搜索树BST中最小元结点的指针；
函数FindMax返回二叉搜索树BST中最大元结点的指针。
 */

